Fast , Adaptively Re ned ComputationalElements in 3
نویسندگان
چکیده
منابع مشابه
Parallel Adaptively Re ned Sparse
A parallel version of a nite diierence discretization of PDEs on sparse grids is proposed. Sparse grids or hyperbolic crosspoints can be used for the eecient representation of solutions of a boundary value problem, especially in high dimensions , because the number of grid points depends only weakly on the dimension. So far only thècombination' technique for regular sparse grids was available o...
متن کاملMultiresolution Representation and Reconstruction of Adaptively Sampled Images
We present a method for sampling, structuring and reconstructing progressively re ned images e ectively. This has direct applications to progressive re nement of the result of slow renderers, such as ray tracers, and to the progressive transmission of images on slow media, as in world wide web browsers. Sampling images adaptively with respect to frequency at the back end provides a more compact...
متن کاملA numerical study of a posteriori error estimators for convection±diusion equations
This paper presents a numerical study of a posteriori error estimators for convection±diusion equations. The study involves the gradient indicator, an a posteriori error estimator which is based on gradient recovery, three residual-based error estimators for dierent norms, and two error estimators which are de®ned by solutions of local Neumann problems. They are compared with respect to the r...
متن کاملInterpolatory Subdivision on Open Quadrilateral Nets with Arbitrary Topology
A simple interpolatory subdivision scheme for quadrilateral nets with arbitrary topology is presented which generates C 1 surfaces in the limit. The scheme satis es important requirements for practical applications in computer graphics and engineering. These requirements include the necessity to generate smooth surfaces with local creases and cusps. The scheme can be applied to open nets in whi...
متن کاملSonderforschungsbereich 393 Numerische Simulation Auf Massiv Parallelen Rechnern the Hierarchical Preconditioning on Locally Reened Unstructured Grids Preprint-reihe Des Chemnitzer Sfb 393
We present the implementation of two hierarchically preconditioned methods for the fast solution of mesh equations that approximate 2D-elliptic boundary value problems on unstructured quasi uniform triangulations constisting of N nodes and having locally reened regions. Based on the ctitious space approach the original problem can be adaptively embedded into an auxiliary one in which hanging no...
متن کامل